Hamming Distance Approach to Reduce Role Mining Scalability

نویسندگان

چکیده

Role-based Access Control has become the standard of practice for many organizations restricting control on limited resources in complicated infrastructures or systems. The main objective role mining development is to define appropriate roles that can be applied specified security access policies. However, scales this kind setting are extensive and cause a huge load management To resolve above mentioned problems, paper proposes model implements Hamming Distance approach by rearranging existing matrix as input data overcome scalability problem. findings show generated file size all datasets substantially have been reduced compared original It also shown technique successfully reduce scale ranging between 30% 47% produce better candidate roles.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hamming distance for conjugates

Let x, y be strings of equal length. The Hamming distance h(x, y) between x and y is the number of positions in which x and y differ. If x is a cyclic shift of y, we say x and y are conjugates. We consider f(x, y), the Hamming distance between the conjugates xy and yx. Over a binary alphabet f(x, y) is always even, and must satisfy a further technical condition. By contrast, over an alphabet of...

متن کامل

Hamming Distance Metric Learning

Motivated by large-scale multimedia applications we propose to learn mappings from high-dimensional data to binary codes that preserve semantic similarity. Binary codes are well suited to large-scale applications as they are storage efficient and permit exact sub-linear kNN search. The framework is applicable to broad families of mappings, and uses a flexible form of triplet ranking loss. We ov...

متن کامل

On Computing the Hamming Distance

Methods for the fast computation of Hamming distance developed for the case of large number of pairs of words are presented and discussed in the paper. The connection of this subject to some questions about intersecting sets and Hadamard designs is also considered.

متن کامل

Dalal's Revision without Hamming Distance

A well known strategy for belief revision is the use of an operator which takes as input a belief base and formula and outputs a new consistent revised belief base. Many operators require additional information such as epistemic entrenchment relations, system of spheres, faithful orderings, subformulae relation, etc. However, in many applications this extra information does not exist and all be...

متن کامل

A Maximum-Hamming-Distance-Based Approach to Code Construction for Trellis-Coded Quantization

A thorough description of trellis-coded quantization as a nearly-optimal source coding system is presented. Trelliscoded quantizers couple traditional quantization techniques with finite state machines to build effective high dimensional vector quantizers. In a trellis-coded quantizer, each transition of the related finite state machine is labeled, by means of a convolutional code, with one of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Advanced Computer Science and Applications

سال: 2023

ISSN: ['2158-107X', '2156-5570']

DOI: https://doi.org/10.14569/ijacsa.2023.0140654